A Method to Single out Maximal Propositional Logics with the Disjunction Property II
نویسندگان
چکیده
This is the second part of a paper devoted to the study of the maximal intermediate propositional logics with the disjunction property (we will simply call maximal constructive logics), whose first part has appeared in this journal with the title “A method to single out maximal propositional logics with the disjunction property I”. In the first part we have explained the general results upon which a method to single out maximal constructive logics is based and have illustrated such a method by exhibiting the Kripke semantics of maximal constructive logics extending the logic ST of Scott, for which, in turn, a semantical characterization in terms of Kripke frames has been given. In the present part we complete the illustration of the method of the first part, having in mind some aspects which might be interesting for a classification of the maximal constructive logics, and an application of the heuristic content of the method to detect the nonmaximality of apparently maximal constructive logics. Thus, on the one hand we introduce the logic AST (“anti” ST), which is compared with ST and is seen as a logic “alternative” (or even “opposite”) to it, in a sense which will be precisely explained. We provide a Kripke semantics for AST and (without exhibiting them) show that (near the ones including ST and the ones including AST) there are maximal constructive logics which neither are extensions of ST nor are extensions of AST. Finally, we give a further application of the results of the first part by exhibiting the Kripke semantics of a maximal constructive logic extending AST. On the other hand, we compare the maximal constructive logics presented in both parts of the paper with a constructive logic introduced by Maksimova (1986), which has been conjectured to be maximal by Chagrov and Zacharyashchev (199 1); from this comparison a disproof of the conjecture arises.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملThe Disjunction Property of the Logics with Axioms of Only One Variable
The logics treated here are the intermediate propositional logics of the form LJ + Ni(a), where Ni(a)’s are axioms of only one variable studied in Nishimura [6]. As is easily seen, the problem of the disjunction property of LJ+Ni(a) starts from i = 10 and the case of odd i can be trivially neglected. The case of i = 10 was solved by Kreisel and Putnam [5] and other cases except i = 14 were solv...
متن کاملThe Disjunction Property according to Kreisel and Putnam
This paper is dedicated to my longtime friend and colleague Roel de Vrijer on the occasion of his sixtieth birthday. With its subject I have tried to go a little in his direction by taking a very syntactic subject. The work is part of a project in progress in cooperation with Rosalie Iemhoff and Nick Vaporis. It concerns the disjunction property in intermediate logics, i.e. logics extending the...
متن کاملFeasible Disjunction Property and Feasible Interpolation in Modal Logic
We prove Feasible Disjunction Property for modal propositional logics K, K4, K4Grz, GL, T, S4, and S4Grz, by a uniform and simple proof based on modular modal sequent proof systems. We derive Feasible Interpolation Theorem for all the logics. Our results are weaker than Hrubeš’ obtained in [9].
متن کاملSub-classical Boolean Bunched Logics and the Meaning of Par
We investigate intermediate logics between the bunched logics Boolean BI and Classical BI, obtained by combining classical propositional logic with various flavours of Hyland and De Paiva’s full intuitionistic linear logic. Thus, in addition to the usual multiplicative conjunction (with its adjoint implication and unit), our logics also feature a multiplicative disjunction (with its adjoint co-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 76 شماره
صفحات -
تاریخ انتشار 1995